Environment Mapping Algorithm Using Semantic Description and Constrained Delaunay Triangulation
نویسندگان
چکیده
منابع مشابه
Constrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملConstrained Delaunay Triangulation using Plane Subdivision
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...
متن کاملThe Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
متن کاملConstrained Delaunay Triangulation for Ad Hoc Networks
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper we propose a new spanner called Constrained Delaunay Triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by in...
متن کاملCapacity-Constrained Delaunay Triangulation for point distributions
Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but are notoriously difficult to generate. We describe an algorithm to very efficiently generate these distributions. The core idea behind our method is to compute a Capacity-Constrained Delaunay Triangulation (CCDT), namely, given a simple polygon P in the plane, and the desired ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Elektronika ir Elektrotechnika
سال: 2019
ISSN: 2029-5731,1392-1215
DOI: 10.5755/j01.eie.25.6.24818